Erratum: Solvent subset selection for polymorph screening
نویسندگان
چکیده
منابع مشابه
Solvent Vapor Annealing of Amorphous Carbamazepine Films for Fast Polymorph Screening and Dissolution Alteration
Solubility enhancement and thus higher bioavailability are of great importance and a constant challenge in pharmaceutical research whereby polymorph screening and selection is one of the most important tasks. A very promising approach for polymorph screening is solvent vapor annealing where a sample is exposed to an atmosphere saturated with molecules of a specific chemical/solvent. In this wor...
متن کاملRemainder Subset Awareness for Feature Subset Selection
Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. It is of the greatest importance to take the most of every evaluation of the inducer, which is normally the more costly part. In this paper, a technique is proposed that takes into account the inducer evaluation both in the ...
متن کاملA Parallel Genetic Algorithm Based Method for Feature Subset Selection in Intrusion Detection Systems
Intrusion detection systems are designed to provide security in computer networks, so that if the attacker crosses other security devices, they can detect and prevent the attack process. One of the most essential challenges in designing these systems is the so called curse of dimensionality. Therefore, in order to obtain satisfactory performance in these systems we have to take advantage of app...
متن کاملWrappers for Feature Subset Selection
In the feature subset selection problem a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention while ignoring the rest To achieve the best possible performance with a particular learning algorithm on a particular training set a feature subset selection method should consider how the algorithm and the training set interact We e...
متن کاملConvex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms to produce exact solutions to subset se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemometrics
سال: 2008
ISSN: 0886-9383,1099-128X
DOI: 10.1002/cem.1140